双纠缠原子在耗散腔场中的纠缠动力学

研究了能量损耗腔中,两纠缠二能级原子与单模辐射场相互作用过程中原子的纠缠动力学.结果表明:双纠缠原子的纠缠度演化特性决定于初始两原子间的纠缠度、纠缠形式、腔场的平均光数、腔场的衰变系数.当原子初始处于一特定纠缠态时,其纠缠度可以放大,并且不受腔场损耗的影响. 关键词： 二能级原子 纠缠度 密度算符 单模辐射场     

线性泛函方程解的振动性的新结果

本文研究高阶泛函方程x(g(t))=P(t)x(t)+Q1(t)x(g2(t))+…+Qk(t)x(gk+1(t))解的振动性,得到了一些新的振动条件.改进和推广了已有结果.     

Microwave Synthesis, Characterization and DNA-binding Properties of a New Cobalt（ Ⅱ ） Complex with 2,6-Bis（benzimidazol-2-yl）pyridine

A new cobalt(Ⅱ) complex with tridentate ligand 2, 6-bis (benzimidazol-2-yl)pyridine has been synthesized by microwave irradiation method and characterized by elemental analysis,electrochemical and spectral methods. The binding of the complex with calf thymus DNA has also been investigated by absorption and fluorescence spectra.     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

凸体的曲率映象与仿射表面积

本文研究了一些特殊凸体与其极体的曲率仿射表面积乘积的下界.对任意两个凸体,建立了它们的投影体的混合体积与其仿射表面积的一个不等式（见文[1-15]）.     

G可积函数的Lebesgue可测性

Botsko在连续和可导的知识基础上推广了Riemann积分,得到了一种新的积分,称为G积分．G积分既不同于Riemann积分也不同于Lebesgue积分．本文通过对G积分的研究,得到了G可积函数一定Lebesgue可测,从而有界G可积函数一定Lebesgue可积;同时我们还证明了这两个积分值相等．     

Investigation of Galilean invariance of multi-phase lattice Boltzmann methods

We examine the Galilean invariance of standard lattice Boltzmann methods for two-phase fluids. We show that the known Galilean invariant term that is cubic in the velocities, and is usually neglected, is a major source of Galilean invariance violations. We show that incorporating a correction term can improve the Galilean invariance of the method by up to two orders of magnitude for large velocities. We found that this is true in particular for methods in which the interactions are incorporated through a forcing term. Methods in which interactions are incorporated through a non-ideal pressure tensor only benefit for large velocities.     

Synchronization of complex dynamical networks with time delays

In the present paper, two kinds of dynamical complex networks are considered. The first is that elements of every node have different time delays but all nodes in such networks have the same time-delay vector. The second is that different nodes have different time-delay vectors, and the elements of each node also have different time delays. Corresponding synchronization theorems are established. Numerical examples show the efficiency of the derived theorems.     

Teleportation of Multi-qudit Entangled States

We propose a method to realize the teleportation of an unknown entangled state that consists of many qudits through a partially entangled-qudit quantum channel with the help of 2 log2 d-bit classical communication. The operations used in the teleportation process include a generalized Bell-state measurement and a series of singlequdit π-measurements performed by Alice, a series of generalized qudit-Pauli gates and two-level unitary gates, as well as a qubit measurement performed by Bob. For a maximally entangled quantum channel, the successful probability of the teleportation becomes unit.     

A note on the computational complexity of graph vertex partition

A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.